Publicly Verifiable Secret Sharing Member-join Protocol For Threshold Signatures
نویسندگان
چکیده
Publicly verifiable secret sharing (PVSS) allows not only shareholders themselves but also everyone verify the shares of a secret distributed by a dealer. It has a lot of electronic applications. In this paper, we propose a publicly verifiable member-join protocol for threshold signatures. In our proposal, a new member can join a PVSS scheme to share the secret only with the help of old shareholders. What’s more, everyone besides the new member can verify the validity of the new member’s share, while only the new member knows his share. Different from previous protocols, our protocol can tolerate a mobile adversary. This proposal adapts to many electronic applications. Finally, we analyze the security of our scheme.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSCRAPE: Scalable Randomness Attested by Public Entities
Uniform randomness beacons whose output can be publicly attested to be unbiased are required in several cryptographic protocols. A common approach to building such beacons is having a number parties run a coin tossing protocol with guaranteed output delivery (so that adversaries cannot simply keep honest parties from obtaining randomness, consequently halting protocols that rely on it). However...
متن کاملImproved Double Auction Protocol based on a Hybrid Trust Model
Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive in computation, and are not robust in dealing with system malfunction or user misbehavior. In this paper, we propose a secure and practical double auction protocols based on a hybrid trust model, where computation loa...
متن کاملAn Improvement of the Ateniese's Verifiable Encryption Protocol
Verifiable encryption is a primitive that can be used to build extremely efficient fair exchange protocols where the items exchanged represent digital signatures. Such protocols may be used to digitally sign contracts on the Internet. This paper presents an efficient protocol for verifiable encryption of digital signatures that improves the security and efficiency of the verifiable encryption s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 3 شماره
صفحات -
تاریخ انتشار 2008